Fair Rent Division on a Budget

نویسندگان

  • Ariel D. Procaccia
  • Rodrigo A. Velez
  • Dingli Yu
چکیده

The standard approach to fair rent division assumes that agents have quasi-linear utilities, and seeks allocations that are envy free; it underlies an algorithm that is widely used in practice. However, this approach does not take budget constraints into account, and, therefore, may assign agents to rooms they cannot afford. By contrast, we design a polynomial-time algorithm that takes budget constraints as part of its input; it determines whether there exist envy-free allocations that satisfy the budget constraints, and, if so, computes one that optimizes an additional criterion of justice. In particular, this gives a polynomial-time implementation of the budget-constrained maximin solution, where the maximization objective is the minimum utility of any agent. We show that, like its non-budget-constrained counterpart, this solution is unique in terms of utilities (when it exists), and satisfies additional desirable properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rental Harmony: Sperner's Lemma in Fair Division

My friend’s dilemma was a practical question that mathematics could answer, both elegantly and constructively. He and his housemates were moving to a house with rooms of various sizes and features, and were having trouble deciding who should get which room and for what part of the total rent. He asked, “Do you think there’s always a way to partition the rent so that each person will prefer a di...

متن کامل

X Which Is the Fairest ( Rent Division ) of Them All ?

What is a fair way to assign rooms to several housemates, and divide the rent between them? This is not just a theoretical question: many people have used the Spliddit website to obtain envy-free solutions to rent division instances. But envy freeness, in and of itself, is insufficient to guarantee outcomes that people view as intuitive and acceptable. We therefore focus on solutions that optim...

متن کامل

Efficient cost sharing with a cheap residual claimant

1 The residual claimant approach The residual claimant is a simple way to align monetary incentives and efficiency. Its most familiar application is to the rich class of Vicrey-Clarke-Groves (VCG) mechanisms. If individual preferences are quasi-linear in money (or any other numeraire) a VCG mechanism takes the "efficient" decision, except for the fact that the budget imbalance must be covered b...

متن کامل

Fair subcarrier and power allocation for multiuser orthogonal frequency-division multiple access cognitive radio networks using a colonel blotto game

The problem of subcarrier allocation (SA) and power allocation (PA) for both the downlink and uplink of cognitive radio networks (CRNs) is studied. Two joint SA and PA schemes based on Blotto games are presented for orthogonal frequency-division multiple access (OFDMA)-based CRNs. In this work, the authors consider a more practical scenario by taking into account the correlation between adjacen...

متن کامل

Room assignment-rent division: A market approach

A group of friends consider renting a house but they shall first agree on how to allocate its rooms and share the rent. We propose an auction mechanism for room assignment-rent division problems which mimics the market mechanism. Our auction mechanism is efficient, envy-free, individually-rational and it yields a non-negative price to each room whenever that is possible with envy-freeness.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017